Context, Collectivity and Emptiness
نویسنده
چکیده
The paper investigates a dynamic alternative to plural e-type strategies, which is general enough to model the truth-conditional as well as the dynamic aspects of both increasing and non-increasing quantifiers. It combines two proposals for plural dynamic semantics: (i) atom predication denotes a set of assignments and set predication denotes a set of sets of assignments and (ii) a witness condition for plural quantification involves checking whether the plurality associated with a specific variable in a set of assignments witnesses the quantification. (i) is a generalisation of van den Berg 1996’s notion of distributed context, while (ii) is a dynamic adaptation of Winter 1999’s determiner fitting approach to plural quantification. Technically, the proposal involves local assignments which are relativised to possible worlds. Pluralisation of such information states leads to possibly empty assignments to local variables. This allows us to refer to an information state which provides an empty set as a potential witness for plural quantification.
منابع مشابه
Collectivity a cultural and processual view 2003 / 8 Mats Alvesson Dan
The paper discusses collectivity in an organizational context. Collectivity refers to the interface between the social and the cultural. It is a social ’unit’, but it is defined through the meanings, definitions and distinctions of the people involved. The paper addresses cultural and processual aspects on collectivity. Eight dimensions of collectivity are highlighted. Two case studies of consu...
متن کاملP-hardness of the emptiness problem for visibly pushdown languages
Visibly pushdown languages form a subclass of the context-free languages which is appealing because of its nice algorithmic and closure properties. Here we show that the emptiness problem for this class is not any easier than the emptiness problem for context-free languages, namely hard for deterministic polynomial time. The proof consists of a reduction from the alternating graph reachability ...
متن کاملQuery and Predicate Emptiness in Description Logics
In ontology-based data access (OBDA), database querying is enriched with an ontology that provides domain knowledge and additional vocabulary for query formulation. We identify query emptiness and predicate emptiness as two central reasoning services in this context. Query emptiness asks whether a given query has an empty answer over all databases formulated in a given vocabulary. Predicate emp...
متن کاملQuery and Predicate Emptiness in Ontology-Based Data Access
In ontology-based data access (OBDA), database querying is enriched with an ontology that provides domain knowledge and additional vocabulary for query formulation. We identify query emptiness and predicate emptiness as two central reasoning services in this context. Query emptiness asks whether a given query has an empty answer over all databases formulated in a given vocabulary. Predicate emp...
متن کاملOn the Complexity of Intersecting Regular, Context-Free, and Tree Languages
We apply a construction of Cook (1971) to show that the intersection nonemptiness problem for one PDA (pushdown automaton) and a finite list of DFA’s (deterministic finite automata) characterizes the complexity class P. In particular, we show that there exist constants c1 and c2 such that for every k, intersection non-emptiness for one PDA and k DFA’s is solvable in O(nc1k) time, but is not sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002